Notes on Channel Routing with Knock-Knees
نویسنده
چکیده
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area. Here, we consider connecting (with knock-knees) sets of N inputs and N outputs on the opposite sides of a rectangular channel, where the output order is a given permutation of the order of corresponding inputs. Such channels are used in many types of VLSI layouts, among them interconnection networks. Here we complete the algorithm of Muthukrishnan et al. and correct its analysis, and adjust the algorithm of Pinter for the same problem conditions.
منابع مشابه
On the Complexity of Knock-knee Channel-Routing with 3-Terminal Nets
In this paper we consider a basic problem in the layout of VLSI-circuits, the channel-routing problem in the knock-knee mode. We show that knock-knee channel routing with 3-terminal nets is NP-complete and thereby settling a problem that was open for more than a decade. In 1987, Sarrafzadeh showed that knock-knee channel routing with 5-terminal nets is NP-complete (Sarrafzadeh, 1987). Furthermo...
متن کاملCompact Layouts for Some Interconnection Networks
In this work we present some compact layouts of interconnection networks and their components. The main parameter for optimization is a layout area. Besides, other features like the number of the wire bends and component scalability are also studied and improved, in some cases. We focus on the layouts on a rectilinear grid. More precisely, it is a square grid. We use the Thompson layout model, ...
متن کاملA New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملLayout of an Arbitrary Permutation in a Minimal Right Triangle Area
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area, while reducing the number of wire bends is also very desirable. Here, we consider connecting sets of N inputs on a line and N outputs on a perpendicular line, inside a right triangle, where the output order is a given permutati...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006